A State-dependent Polling Model with Markovian Routing
نویسندگان
چکیده
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalizes the classical Markovian polling model, in the sense that two routing matrices are involved, the choice being made according to the state of the last visited queue. The stationary distribution of the position of the server is given. Ergodicity conditions are obtained by means of an associated dynamical system. Under rotational symmetry assumptions, average queue length and mean waiting times are computed.
منابع مشابه
Numerical Solution of Polling Systems for Analyzing Networks on Chips
This paper introduces a numerical solution method for a class of discrete-time polling systems by relying on the power method, Kronecker matrix representations and the shuffle algorithm. The class of polling models considered consists of several infinite pseudo queues, deterministic service times, Bernoulli service and Markovian routing and includes exhaustive, 1-limited and k-limited service a...
متن کاملApproximation of discrete-time polling systems via structured Markov chains
We devise an approximation of the marginal queue length distribution in discrete-time polling systems with batch arrivals and fixed packet sizes. The polling server uses the Bernoulli service discipline and Markovian routing. The 1-limited and exhaustive service disciplines are special cases of the Bernoulli service discipline, and traditional cyclic routing is a special case of Markovian routi...
متن کاملMulticlass Polling Systems with Markovian Feedback: Mean Sojourn times in Gated and Exhaustive Systems with Local Priority and Fcfs Service Orders
We consider polling systems in which a single server visits stations in cyclic order and serves customers at each station according to either the gated rule or the exhaustive rule of the station. There are multiple classes of customers at each station, and they are served in either the priority order or the first-come-first-served (FCFS) order. After completing a service at a station, each cust...
متن کاملMonte Carlo Simulation to Compare Markovian and Neural Network Models for Reliability Assessment in Multiple AGV Manufacturing System
We compare two approaches for a Markovian model in flexible manufacturing systems (FMSs) using Monte Carlo simulation. The model which is a development of Fazlollahtabar and Saidi-Mehrabad (2013), considers two features of automated flexible manufacturing systems equipped with automated guided vehicle (AGV) namely, the reliability of machines and the reliability of AGVs in a multiple AGV jobsho...
متن کاملMarkovian polling systems with an application to wireless random-access networks
Motivated by an application in wireless random-access networks, we study a class of polling systems with Markovian routing, in which the server visits the queues in an order governed by a discrete-time Markov chain. Assuming that the service disciplines at each of the queues fall in the class of branching-type service disciplines, we derive a functional equation for (the probability generating ...
متن کامل